On Fast and Provably Secure Message Authentication Based on Universal Hashing

There are well-known techniques for message authentication using universal hash functions. This approach seems very promising, as it provides schemes that are both eecient and provably secure under reasonable assumptions. This paper contributes to this line of research in two ways. First, it analyzes the basic construction and some variants under more realistic and practical assumptions. Second, it shows how these schemes can be eeciently implemented, and it reports on the results of empirical performance tests that demonstrate that these schemes are competitive with other commonly employed schemes whose security is less well-established.